Symmetric duality in multi-objective programming
نویسندگان
چکیده
منابع مشابه
Duality of Multi-objective Programming
The convexity theory plays an important role in many aspects of mathematical programming. In recent years, in order to relax convexity assumption, various generalized convexity notions have been obtained. One of them is the concept of ) , ( r p B− invexity defined by T.Antczak [1], which extended the class of B − invex functions with respect toη and b and the classes of ) , ( r p invex function...
متن کاملHigher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions
A pair of Mond–Weir type multi-objective higher order symmetric dual programs over arbitrary cones is formulated. Weak, strong and converse duality theorems are established under higher order K –F-convexity assumptions. Our results generalize several known results in the literature.
متن کاملSecond Order Mixed Symmetric Duality in Non-differentiable Multi-objective Mathematical Programming
A pair of Mond-Weir type second order mixed symmetric duals is presented for a class of non-differentiable multi-objective nonlinear programming problems with multiple arguments. We establish duality theorems for the new pair of dual models under second order generalized convexity assumptions. This mixed second order dual formulation unifies the two existing second order symmetric dual formulat...
متن کاملInteger Programming Duality in Multiple Objective Programming
The weighted sums approach for linear and convex multiple criteria optimization is well studied. The weights determine a linear function of the criteria approximating a decision makers overall utility. Any efficient solution may be found in this way. This is not the case for multiple criteria integer programming. However, in this case one may apply the more general e-constraint approach, result...
متن کاملOn duality in multiple objective linear programming
We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
سال: 1993
ISSN: 0334-2700,1839-4078
DOI: 10.1017/s0334270000009127